全文获取类型
收费全文 | 165篇 |
免费 | 17篇 |
国内免费 | 5篇 |
出版年
2021年 | 1篇 |
2020年 | 2篇 |
2019年 | 1篇 |
2018年 | 1篇 |
2017年 | 1篇 |
2016年 | 2篇 |
2015年 | 4篇 |
2014年 | 7篇 |
2013年 | 6篇 |
2012年 | 4篇 |
2011年 | 26篇 |
2010年 | 11篇 |
2009年 | 14篇 |
2008年 | 18篇 |
2007年 | 20篇 |
2006年 | 18篇 |
2005年 | 13篇 |
2004年 | 9篇 |
2003年 | 7篇 |
2002年 | 6篇 |
2001年 | 2篇 |
2000年 | 1篇 |
1999年 | 2篇 |
1996年 | 2篇 |
1995年 | 1篇 |
1994年 | 1篇 |
1993年 | 2篇 |
1991年 | 1篇 |
1990年 | 2篇 |
1989年 | 1篇 |
1975年 | 1篇 |
排序方式: 共有187条查询结果,搜索用时 15 毫秒
71.
公安边防海警部队官兵在海上训练、执勤、执法实践中,由于种种因素诱发出多种心理问题。着重探析海警部队海上执勤训练中官兵心理问题的主要表现及其主要原因,旨在探讨解决官兵心理问题的主要途径。 相似文献
72.
介绍了我国消防通信装备在使用中的现状;重点从消防通信装备的配备、技术和管理几方面分析了消防通信装备在使用中存在的问题;从完善火场通信联络方式、不断改进常规、集群无线组网功能、推动数字化手机和消防通信头盔的运用等方面提出了解决问题的对策。 相似文献
73.
This article describes a polynomial transformation for a class of unit‐demand vehicle routing problems, named node‐balanced routing problems (BRP), where the number of nodes on each route is restricted to be in an interval such that the workload across the routes is balanced. The transformation is general in that it can be applied to single or multiple depot, homogeneous or heterogeneous fleet BRPs, and any combination thereof. At the heart of the procedure lies transforming the BRP into a generalized traveling salesman problem (TSP), which can then be transformed into a TSP. The transformed graph exhibits special properties which can be exploited to significantly reduce the number of arcs, and used to construct a formulation for the resulting TSP that amounts to no more than that of a constrained assignment problem. Computational results on a number of instances are presented. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 370–387, 2015 相似文献
74.
通过引入保障时间窗,同时考虑油料保障的时间约束和运力约束,建立了基于保障开始时间最早,并尽可能满足保障需求量的调度模型。针对问题的多目标性,基于理想点法将初始模型转化为单目标优化模型。采用粒子群算法对模型进行求解,并设计了算法编码和求解步骤。通过算例验证了模型和算法的可行性及有效性。 相似文献
75.
董士杰 《军械工程学院学报》2014,(4):61-65
研究非线性脉冲微分方程边值问题,应用分歧技巧,得到非线性脉冲微分方程边值问题多个解的存在性结果. 相似文献
76.
Elsie Sterbin Gottlieb 《海军后勤学研究》2002,49(7):666-685
This paper investigates certain issues of coefficient sensitivity in generalized network problems when such problems have small gains or losses. In these instances, it might be computationally advantageous to temporarily ignore these gains or losses and solve the resultant “pure” network problem. Subsequently, the optimal solution to the pure problem could be used to derive the optimal solution to the original generalized network problem. In this paper we focus on generalized transportation problems and consider the following question: Given an optimal solution to the pure transportation problem, under what conditions will the optimal solution to the original generalized transportation problem have the same basic variables? We study special cases of the generalized transportation problem in terms of convexity with respect to a basis. For the special case when all gains or losses are identical, we show that convexity holds. We use this result to determine conditions on the magnitude of the gains or losses such that the optimal solutions to both the generalized transportation problem and the associated pure transportation problem have the same basic variables. For more general cases, we establish sufficient conditions for convexity and feasibility. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 666–685, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10034 相似文献
77.
Stochastic transportation networks arise in various real world applications, for which the probability of the existence of a feasible flow is regarded as an important performance measure. Although the necessary and sufficient condition for the existence of a feasible flow represented by an exponential number of inequalities is a well‐known result in the literature, the computation of the probability of all such inequalities being satisfied jointly is a daunting challenge. The state‐of‐the‐art approach of Prékopa and Boros, Operat Res 39 (1991) 119–129 approximates this probability by giving its lower and upper bounds using a two‐part procedure. The first part eliminates all redundant inequalities and the second gives the lower and upper bounds of the probability by solving two well‐defined linear programs with the inputs obtained from the first part. Unfortunately, the first part may still leave many non‐redundant inequalities. In this case, it would be very time consuming to compute the inputs for the second part even for small‐sized networks. In this paper, we first present a model that can be used to eliminate all redundant inequalities and give the corresponding computational results for the same numerical examples used in Prékopa and Boros, Operat Res 39 (1991) 119–129. We also show how to improve the lower and upper bounds of the probability using the multitree and hypermultitree, respectively. Furthermore, we propose an exact solution approach based on the state space decomposition to compute the probability. We derive a feasible state from a state space and then decompose the space into several disjoint subspaces iteratively. The probability is equal to the sum of the probabilities in these subspaces. We use the 8‐node and 15‐node network examples in Prékopa and Boros, Operat Res 39 (1991) 119–129 and the Sioux‐Falls network with 24 nodes to show that the space decomposition algorithm can obtain the exact probability of these classical examples efficiently. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 479–491, 2016 相似文献
78.
79.
将低扩散通量分裂格式(LDFSS)和加权基本无振荡格式(WENO)相结合,构造出一种混合格式,其中WENO格式用于物理量重构,而LDFSS用于通量分裂。采用这种格式对Riemann问题、钝头体高超声速无粘绕流流场进行了计算,并对超声速平板湍流边界层进行了混合LES/RANS模拟,计算结果表明:相对于采用Lax-Fridrichs分裂的WENO格式来说,这种混合格式对于激波和接触间断的分辨率更高,并且在标量保正性方面更优,收敛性更好;而相对于采用带有Minmod限制器的MUSCL方法进行物理量高阶重构的LDFSS格式来说,这种混合格式在混合模拟的计算中能够更好地反映湍流流场的脉动特性,计算得到的湍流速度脉动量的统计值更加准确。 相似文献
80.
基于熵权多目标决策的战时物资运输方案优选研究 总被引:11,自引:0,他引:11
提出了战时物资运输方案优选问题,分析战时运输的影响因素,提出了评估战时物资运输方案的较有代表性的指标,并给出了具体计算方法.在没有指标权重的情况下,应用熵权多目标决策方法对多个合理方案进行优选评估,得出了可信度较高的优选方案. 相似文献